(t, n) Threshold d-Level Quantum Secret Sharing
نویسندگان
چکیده
منابع مشابه
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
In this paper, we show that there exists a t-cheater identi able (k; n) threshold secret sharing scheme such as follows for cheating probability " > 0. If k 3t+ 1, then 1. Just k participants are enough to identify who are cheaters. 2. jV i j is independent of n. That is, jV i j = jSj(1=") (t+2) , where S denotes the set of secrets and V i denotes the set of shares of a participant P i , respec...
متن کاملSecret Sharing with a Single d-level Quantum System
Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a message is divided into shares given to recipient parties in such a way that some number of parties need to collaborate in order to reconstruct the message. Quantum protocols for the task commonly rely on mul...
متن کاملThreshold Secret Image Sharing
A (k, n) threshold secret image sharing scheme, abbreviated as (k, n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k, n)-TSISS, Thien and Lin reduced the size of each shadow image to 1 k of the original secret image. Their main technique is by adopting all coefficients of a (k − 1)-deg...
متن کاملIdeal Hierarchical (t, n) Secret Sharing Schemes
A secret sharing scheme divides a secret into multiple shares by a dealer and shared among shareholders in such a way that any authorized subset of shareholders can reconstruct the secret; whereas any un-authorized subset of shareholders cannot recover the secret. If the maximal length of shares is equal to the length of the secret in a secret sharing scheme, the scheme is called ideal. If the ...
متن کاملFair secret reconstruction in (t, n) secret sharing
In Shamir’s (t, n) threshold secret sharing scheme, one secret s is divided into n shares by a dealer and all shares are shared among n shareholders, such that knowing t or more than t shares can reconstruct this secret; but knowing fewer than t shares cannot reveal any information about the secret s. The secret reconstruction phase in Shamir’s (t, n) threshold secret sharing is very simple and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2017
ISSN: 2045-2322
DOI: 10.1038/s41598-017-06486-4